Relation Representation Learning via Signed Graph Mutual Information Maximization for Trust Prediction

نویسندگان

چکیده

Trust prediction is essential to enhancing reliability and reducing risk from the unreliable node, especially for online applications in open network environments. An fact trust measure relation of both interacting entities accurately. However, most existing methods infer between usually rely on modeling similarity nodes a graph ignore semantic influence negative links (e.g., distrust relation). In this paper, we proposed representation learning via signed mutual information maximization (called SGMIM). SGMIM, incorporate translation model positive point-wise enhance representations adopt Mutual Information Maximization align entity spaces. Moreover, further develop sign making accurate predictions. We conduct link networks based learned representation. Extensive experimental results four real-world datasets task show that SGMIM significantly outperforms state-of-the-art baseline methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph matching vs mutual information maximization for object detection

Labeled Graph Matching (LGM) has been shown successful in numerous object vision tasks. This method is the basis for arguably the best face recognition system in the world. We present an algorithm for visual pattern recognition that is an extension of LGM ('LGM+'). We compare the performance of LGM and LGM+ algorithms with a state of the art statistical method based on Mutual Information Maximi...

متن کامل

Learning Mutual Trust

ABSTRACT Multiagent learning literature has looked at iterated twoplayer games to develop me hanisms that allow agents to learn to onverge on Nash Equilibrium strategy pro les. Su h equilibrium on guration implies that there is no motivation for one player to hange its strategy if the other does not. Often, in general sum games, a higher payo an be obtained by both players if one hooses not to ...

متن کامل

Alignment by Maximization of Mutual Information Alignment B Y Maximization of Mutual Information

A new information-theoretic approach is presented for nding the pose of an object in an image. The technique does not require information about the surface properties of the object, besides its shape, and is robust with respect to variations of illumination. In our derivation, few assumptions are made about the nature of the imaging process. As a result the algorithms are quite general and can ...

متن کامل

Uncertainty relation for mutual information

James Schneeloch,1,2 Curtis J. Broadbent,1,2,3 and John C. Howell1,2 1Department of Physics and Astronomy, University of Rochester, Rochester, New York 14627, USA 2Center for Coherence and Quantum Optics, University of Rochester, Rochester, New York 14627, USA 3Rochester Theory Center, University of Rochester, Rochester, New York 14627, USA (Received 25 April 2014; revised manuscript received 2...

متن کامل

Statistical mechanics of mutual information maximization

– An unsupervised learning procedure based on maximizing the mutual information between the outputs of two networks receiving different but statistically dependent inputs is analyzed (Becker S. and Hinton G., Nature, 355 (1992) 161). By exploiting a formal analogy to supervised learning in parity machines, the theory of zero-temperature Gibbs learning for the unsupervised procedure is presented...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2021

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym13010115